Hybrid tag recommendation for social annotation systems.

Resource Recommendation in Collaborative Tagging Applications.

2nd workshop on recommender systems and the social web.

Advances in Web Mining and Web Usage Analysis

Evaluating the Impact of Attacks in Collaborative Tagging Environments.

Evaluating the Impact of Attacks in Collaborative Tagging Environments.

Adapting K%2DNearest Neighbor for Tag Recommendation in Folksonomies.
Folksonomies, otherwise known as Collaborative Tagging Systems, enable Internet users to share, annotate and search for online resources with user selected labels called tags. Tag recommendation, the suggestion of an ordered set of tags during the annotation process, reduces the user effort from a keyboard entry to a mouse click. By simplifying the annotation process tagging is promoted, noise in the data is reduced through the elimination of discrepancies that result in redundant tags, and ambiguous tags may be avoided. Tag recommenders can suggest tags that maximize utility, offer tags the user may not have previously considered or steer users toward adopting a core vocabulary. In sum, tag recommendation promotes a denser dataset that is useful in its own right or can be exploited by a myriad of data mining techniques for additional functionality. While there exists a long history of recommendation algorithms, the data structure of a Folksonomy is distinct from those found in traditional recommendation problems. We first explore two data reduction techniques, p-core processing and Hebbian deflation, then demonstrate how to adapt K-Nearest Neighbor for use with Folksonomies by incorporating user, resource and tag information into the algorithm. We further investigate multiple techniques for user modeling required to compute the similarity among users. Additionally we demonstrate that tag boosting, the promoting of tags previously applied by a user to a resource, improves the coverage and accuracy of K-Nearest Neighbor. These techniques are evaluated through extensive experimentation using data collected from two real Collaborative Tagging Web sites. Finally the modified K-Nearest Neighbor algorithm is compared with alternative techniques based on popularity and link analysis. We find that K-Nearest Neighbor modified for use with Folksonomies generates excellent recommendations, scales well with large datasets, and is applicable to both narrow and broadly focused Folksonomies.
Enhancing Stakeholder Profiles to Improve Recommendations in Online Requirements Elicitation.

A recommender system for dynamically evolving online forums.

Workshop on recommender systems and the social web.

The impact of ambiguity and redundancy on tag recommendation in folksonomies.

A recommender system for requirements elicitation in large%2Dscale software projects.

AAAI 2008 Workshop Reports.

Preface to the special issue on data mining for personalization.

Proceedings of the 2008 ACM Conference on Recommender Systems
In a previous paper we presented various ideas on how information retrieval on mind maps could enhance applications such as expert systems, search engines and recommender systems. In this paper we present the first research results. In a brief experiment we researched link analysis respectively citation analysis, if applied to mind maps, is suitable to calculate document relatedness. The basic idea is that if two documents A and B are linked by the same mind map, these documents are likely to be related. This information could be used by itembased document recommender systems. In the example, document B could be recommended to those users interested in document A. In addition, we propose that those documents linked in high proximity within a mind map are more closely related than those documents linked in lower proximity. The results of our experiment support our ideas. It seems that link analysis applied to mind maps can be used for determining the relatedness of documents and therefore for improving document recommender systems. Categories and Subject Descriptors H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval – information filtering, retrieval models, search process
A consensus based approach to constrained clustering of software requirements.
Managing large-scale software projects involves a number of activities such as viewpoint extraction, feature detection, and requirements management, all of which require a human analyst to perform the arduous task of organizing requirements into meaningful topics and themes. Automating these tasks through the use of data mining techniques such as clustering could potentially increase both the efficiency of performing the tasks and the reliability of the results. Unfortunately, the unique characteristics of this domain, such as high dimensional, sparse, noisy data sets, resulting from short and ambiguous expressions of need, as well as the need for the interactive engagement of stakeholders at various stages of the process, present difficult challenges for standard clustering algorithms. In this paper, we propose a semisupervised clustering framework, based on a combination of consensus-based and constrained clustering techniques, which can effectively handle these challenges. Specifically, we provide a probabilistic analysis for informative constraint generation based on a co-association matrix, and utilize consensus clustering to combine multiple constrained partitions in order to generate highquality, robust clusters. Our approach is validated through a series of experiments on six well-studied TREC data sets and on two sets of user requirements.
Personalizing Navigation in Folksonomies Using Hierarchical Tag Clustering.

International workshop on recommendation and collaboration %28ReColl 2008%29.

Using Data Mining and Recommender Systems to Facilitate Large%2DScale
Requirements related problems, especially those originating from inadequacies in the human-intensive task of eliciting stakeholders ’ needs and desires, have contributed to many failed and challenged software projects. This is especially true for large and complex projects in which requirements knowledge is distributed across thousands of stakeholders. This short paper introduces a new process and related framework that utilizes data mining and recommender technologies to create an open, scalable, and inclusive requirements elicitation process capable of supporting projects with thousands of stakeholders. The approach is illustrated and evaluated using feature requests mined from an open source software product.
Personalized recommendation in social tagging systems using hierarchical clustering.
Collaborative tagging applications allow Internet users to annotate resources with personalized tags. The complex network created by many annotations, often called a folksonomy, permits users the freedom to explore tags, resources or even other user’s profiles unbound from a rigid predefined conceptual hierarchy. However, the freedom afforded users comes at a cost: an uncontrolled vocabulary can result in tag redundancy and ambiguity hindering navigation. Data mining techniques, such as clustering, provide a means to remedy these problems by identifying trends and reducing noise. Tag clusters can also be used as the basis for effective personalized recommendation assisting users in navigation. We present a personalization algorithm for recommendation in folksonomies which relies on hierarchical tag clusters. Our basic recommendation framework is independent of the clustering method, but we use a context-dependent variant of hierarchical agglomerative clustering which takes into account the user’s current navigation context in cluster selection. We present extensive experimental results on two real world dataset. While the personalization algorithm is successful in both cases, our results suggest that folksonomies encompassing only one topic domain, rather than many topics, present an easier target for recommendation, perhaps because they are more focused and often less sparse. Furthermore, context dependent cluster selection, an integral step in our personalization algorithm, demonstrates more utility for recommendation in multi-topic folksonomies than in single-topic folksonomies. This observation suggests that topic selection is an important strategy for recommendation in multi-topic folksonomies.
A Survey of Collaborative Recommendation and the Robustness of Model%2DBased Algorithms.
The open nature of collaborative recommender systems allows attackers who inject biased profile data to have a significant impact on the recommendations produced. Standard memory-based collaborative filtering algorithms, such as k-nearest neighbor, are quite vulnerable to profile injection attacks. Previous work has shown that some model-based techniques are more robust than standard k-nn. Model abstraction can inhibit certain aspects of an attack, providing an algorithmic approach to minimizing attack effectiveness. In this paper, we examine the robustness of several recommendation algorithms that use different model-based techniques: user clustering, feature reduction, and association rules. In particular, we consider techniques based on k-means and probabilistic latent semantic analysis (pLSA) that compare the profile of an active user to aggregate user clusters, rather than the original profiles. We then consider a recommendation algorithm that uses principal component analysis (PCA) to calculate the similarity between user profiles based on reduced dimensions. Finally, we consider a recommendation algorithm based on the data mining technique of association rule mining using the Apriori algorithm. Our results show that all techniques offer large improvements in stability and robustness compared to standard k-nearest neighbor. In particular, the Apriori algorithm performs extremely well against lowknowledge attacks, but at a cost of reduced coverage, and the PCA algorithm performs extremely well against focused attacks. Furthermore, our results show that all techniques can achieve comparable recommendation accuracy to standard k-nn. 1
WebKDD 2008 10 years of knowledge discovery on the web post%2Dworkshop report.

Advances in Web Mining and Web Usage Analysis

Web search personalization with ontological user profiles.

Representing Context in Web Search with Ontological User Profiles.
Abstract. One of the key factors for effective personalization of information access is the user context. We propose a framework which integrates several critical elements that make up the user context, namely, the user’s short-term behavior, semantic knowledge from ontologies that provide explicit representations of the domain of interest, and long-term user profiles revealing interests and trends. Our proposed approach involves implicitly building ontological user profiles by assigning interest scores to existing concepts in a domain ontology. These profiles are, therefore, maintained and updated as annotated instances of a reference domain ontology. We propose a spreading activation algorithm for maintaining the interest scores in the user profile based on the user’s ongoing behavior. Our experimental results show that the user context can be effectively utilized for Web search personalization. Specifically, re-ranking the search results based on interest scores derived from the semantic evidence in an ontological user profile provides better search results by proficiently bringing results closer to the top when they are most relevant to the user. 1
Crawling Attacks Against Web%2Dbased Recommender Systems.

Impact of Relevance Measures on the Robustness and Accuracy of Collaborative Filtering.

Robustness of collaborative recommendation based on association rule mining.

Data Mining for Web Personalization.

Ontological User Profiles for Representing Context in Web Search.

Introduction to intelligent techniques for Web personalization.

Toward trustworthy recommender systems An analysis of attack models and algorithm robustness.

AAAI%2D07 Workshop Reports.

Recommender Systems.
 © ACM, 2004. This is the author&#039;s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM
Attacks and Remedies in Collaborative Recommendation.

Recommender Systems.
 © ACM, 2004. This is the author&#039;s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM
WebKDD%2FSNAKDD 2007 web mining and social network analysis post%2Dworkshop report.

Defending recommender systems detection of profile injection attacks.

Advances in Web Mining and Web Usage Analysis

Advances in Web Mining and Web Usage Analysis

Model%2DBased Collaborative Filtering as a Defense against Profile Injection Attacks.

Detecting Profile Injection Attacks in Collaborative Recommender Systems.
Collaborative recommender systems are known to be highly vulnerable to profile injection attacks, attacks that involve the insertion of biased profiles into the ratings database for the purpose of altering the system’s recommendation behavior. In prior work, we and others have identified a number of models for such attacks and shown their effectiveness. This paper describes a classification approach to the problem of detecting and responding to profile injection attacks. This technique significantly reduces the effectiveness of the most powerful attack models previously studied. 1.
Web User Segmentation Based on a Mixture of Factor Analyzers.

Classification features for attack detection in collaborative recommender systems.

Detecting Profile Injection Attacks in Collaborative Filtering A Classification%2DBased Approach.

Contextual Recommendation.
The potential benefit of integrating contextual information for recommendation has received much research attention recently, especially with the ever-increasing interest in mobile-based recommendation services. However, context based recommendation research is limited due to the lack of standard evaluation data with contextual information and reliable technology for extracting such information. As a result, there are no widely accepted conclusions on how, when and whether context helps. Additionally, a system often suffers from the so called cold start problem due to the lack of data for training the initial context based recommendation model. This paper proposes a novel solution to address these problems with automated information extraction techniques. We also compare several approaches for utilizing context based on a new data set collected using the proposed solution. The experimental results demonstrate that 1) IE-based techniques can help create a large scale context data with decent quality from online reviews, at least for restaurant recommendations; 2) context helps recommender systems rank items, however, does not help predict user ratings; 3) simply using context to filter items hurts recommendation per-Bingqing Wang’s work is done during his stay in the Research
Reports on the Twenty%2DFirst National Conference on Artificial Intelligence %28AAAI%2D06%29 Workshop Program.

WebKDD 2006 web mining and web usage analysis post%2Dworkshop report.
In this report, we summarize the contents and outcomes of
Intelligent Techniques for Web Personalization

Segment%2DBased Injection Attacks against Collaborative Filtering Recommender Systems.
Significant vulnerabilities have recently been identified in collaborative filtering recommender systems. Researchers have shown that attackers can manipulate a system’s recommendations by injecting biased profiles into it. In this paper, we examine attacks that concentrate on a targeted set of users with similar tastes, biasing the system’s responses to these users. We show that such attacks are both pragmatically reasonable and also highly effective against both user-based and itembased algorithms. As a result, an attacker can mount such a “segmented ” attack with little knowledge of the specific system being targeted and with strong likelihood of success. 1.
A Web Recommendation System Based on Maximum Entropy.
We propose a Web recommendation system based on a maximum entropy model. Under the maximum entropy principle, we can combine multiple levels of knowledge about users ’ navigational behavior in order to automatically generate the most effective recommendations for new users with similar profiles. The knowledge include the page-level statistics about users’ historically visited pages, and the aggregate usage patterns discovered through Web usage mining. In particular, we use a Web mining framework based on Probabilistic Latent Semantic Analysis to discover the underlying interests of Web users as well as temporal changes in these interests. Our experiments show that our recommendation system can achieve better accuracy when compared to standard approaches, while providing a better interpretation of Web users ’ diverse navigational behavior. 1
A maximum entropy web recommendation system combining collaborative and content features.

A maximum entropy web recommendation system combining collaborative and content features.

Task%2DOriented Web User Modeling for Recommendation.

The Workshop Program at the Nineteenth National Conference on Artificial Intelligence.

WebKDD 2005 web mining and web usage analysis post%2Dworkshop report.

Web usage mining based on probabilistic latent semantic analysis.

WebKDD 2004 web mining and web usage analysis post%2Dworkshop report.

Semantically Enhanced Collaborative Filtering on the Web.

Intelligent Techniques for Web Personalization.

A Road Map to More Effective Web Personalization Integrating Domain Knowledge with Web Usage Mining.

Concept Based Query Enhancement in the ARCH Search Agent.

A Framework for the Evaluation of Session Reconstruction Heuristics in Web%2DUsage Analysis.

Using Sequential and Non%2DSequential Patterns in Predictive Web Usage Mining Tasks.

The Impact of Site Structure and User Environment on Session Reconstruction in Web Usage Analysis.

Discovery and Evaluation of Aggregate Usage Profiles for Web Personalization.
Web usage mining, possibly used in conjunction with standard approaches to personalization such as collaborative filtering, can help address some of the shortcomings of these techniques, including reliance on subjective user ratings, lack of scalability, and poor performance in the face of high-dimensional and sparse data. However, the discovery of patterns from usage data by itself is not sufficient for performing the personalization tasks. The critical step is the effective derivation of good quality and useful (i.e., actionable) &#034;aggregate usage profiles&#034; from these patterns. In this paper we present and experimentally evaluate two techniques, based on clustering of user transactions and clustering of pageviews, in order to discover overlapping aggregate profiles that can be effectively used by recommender systems for real-time Web personalization. We evaluate these techniques both in terms of the quality of the individual profiles generated, as well as in the context of providing recommendations as an integrated part of a personalization engine. In particular, our results indicate that using the generated aggregate profiles, we can achieve effective personalization at early stages of users&#039; visits to a site, based only on anonymous clickstream data and without the benefit of explicit input by these users or deeper knowledge about them.
Discovery and Evaluation of Aggregate Usage Profiles for Web Personalization.
Web usage mining, possibly used in conjunction with standard approaches to personalization such as collaborative filtering, can help address some of the shortcomings of these techniques, including reliance on subjective user ratings, lack of scalability, and poor performance in the face of high-dimensional and sparse data. However, the discovery of patterns from usage data by itself is not sufficient for performing the personalization tasks. The critical step is the effective derivation of good quality and useful (i.e., actionable) &#034;aggregate usage profiles&#034; from these patterns. In this paper we present and experimentally evaluate two techniques, based on clustering of user transactions and clustering of pageviews, in order to discover overlapping aggregate profiles that can be effectively used by recommender systems for real-time Web personalization. We evaluate these techniques both in terms of the quality of the individual profiles generated, as well as in the context of providing recommendations as an integrated part of a personalization engine. In particular, our results indicate that using the generated aggregate profiles, we can achieve effective personalization at early stages of users&#039; visits to a site, based only on anonymous clickstream data and without the benefit of explicit input by these users or deeper knowledge about them.
Effective personalization based on association rule discovery from web usage data.

Decision Processes in Agent%2DBased Automated Contracting.

Integrating Web Usage and Content Mining for More Effective Personalization.
Recent proposals have suggested Web usage mining as an enabling  mechanism to overcome the problems associated with more traditional  Web personalization techniques such as collaborative or contentbased  filtering. These problems include lack of scalability, reliance on  subjective user ratings or static profiles, and the inability to capture  a richer set of semantic relationships among objects (in content-based  systems). Yet, usage-based personalization can be problematic when little  usage data is available pertaining to some objects or when the site  contentchanges regularly.For more effective personalization, both usage  and content attributes of a site must be integrated into a Web mining  framework and used by the recommendation engine in a uniform manner. In this
Automatic personalization based on Web usage mining.

Bid Selection Strategies for Multi%2Dagent Contracting in the Presence of Scheduling Constraints.
Bid evaluation in a multi-agent automated contracting environment  presents a challenging search problem. We introduce a multicriterion,  anytime bid evaluation strategy that incorporates cost, task  coverage, temporal feasibility, and risk estimation into a simulated annealing  framework. We report on an experimental evaluation using a set  of increasingly informed search heuristics within simulated annealing.
Evaluating Risk Flexibility and Feasibility in Multi%2DAgent Contracting.

Document Categorization and Query Generation on the World Wide Web Using WebACE.
We present WebACE, an agent for exploring and categorizing documents on the World Wide Web based on a user profile. The heart of the agent is an unsupervised categorization of a set of documents, combined with a process for generating new queries that is used to search for new related documents and for filtering the resulting documents to extract the ones most closely related to the starting set. The document categories are not given a priori. We present the overall architecture and describe two novel algorithms which provide significant improvement over traditional clustering algorithms and form the basis for the query generation and search component of the agent. We report on the results of our experiments comparing these new algorithms with more traditional clustering algorithms and we show that our algorithms are fast and scalable.
Data Preparation for Mining World Wide Web Browsing Patterns.
The World Wide Web (WWW) continues to grow at an astounding  rate in both the sheer volume of tra#c and the size and complexity  of Web sites. The complexity of tasks such as Web site design,  Web server design, and of simply navigating through a Web site have  increased along with this growth. An important input to these design  tasks is the analysis of how a Web site is being used. Usage analysis includes  straightforward statistics, such as page access frequency, as well as  more sophisticated forms of analysis, such as finding the common traversal  paths through a Web site. Web Usage Mining is the application of  data mining techniques to usage logs of large Web data repositories in  order to produce results that can be used in the design tasks mentioned  above. However, there are several preprocessing tasks that must be performed  prior to applying data mining algorithms to the data collected  from server logs. This paper presents several data preparation techniques  in order to identify unique users and user sessions. Also, a method to divide  user sessions into semantically meaningful transactions is defined  and successfully tested against two other methods. Transactions identified  by the proposed methods are used to discover association rules from  real world data using the WEBMINER system [15].
Bid Evaluation and Selection in the MAGNET Automated Contracting System.

A Market Architecture for Multi%2DAgent Contracting.
We present a generalized market architecture that provides support for a variety of types of transactions, from simple buying and selling of goods and services to complex multi-agent contract negotiations. This architecture is organized around three basic components: the exchange, the market, and the session. We also present a negotiation protocol for planning by contracting that takes advantage of the services of the market. We show how the existence of an appropriate market infrastructure can add value to a multi-agent contracting protocol by controlling fraud and discouraging counterspeculation.


Hypergraph Based Clustering in High%2DDimensional Data Sets A Summary of Results.
Clustering of data in a large dimension space is of a great interest in many data mining applications. In this paper, we propose a method for clustering of data in a high dimensional space based on a hypergraph model. In this method, the relationship present in the original data in high dimensional space are mapped into a hypergraph. A hyperedge represents a relationship (affinity) among subsets of data and the weight of the hyperedge reflects the strength of this affinity. A hypergraph partitioning algorithm is used to find a partitioning of the vertices such that the corresponding data items in each partition are highly related and the weight of the hyperedges cut by the partitioning is minimized. We present results of experiments on two different data sets: S&amp;P500 stock data for the period of 1994-1996 and protein coding data. These experiments demonstrate that our approach is applicable and effective in high dimensional datasets. 1 Introduction  Clustering in data mining is a disco...
Clustering Based On Association Rule Hypergraphs.
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These discovered clusters are used to explain the characteristics of the data distribution. In this paper we propose a new methodology for clustering related items using association rules, and clustering related transactions using clusters of items. Our approach is linearly scalable with respect to the number of transactions. The frequent item-sets used to derive association rules are also used to group items into a hypergraph edge, and a hypergraph partitioning algorithm is used to find the clusters. Our experiments indicate that clustering using association rule hypergraphs holds great promise in several application domains. Our experiments with stock-market data and congressional voting data show that this clustering scheme is able to successfully group items that belong to the same group. Clustering of items can ...
Web Mining Information and Pattern Discovery on the World Wide Web.
Application of data mining techniques to the World Wide Web, referred to as Web mining, has been the focus of several recent research projects and papers. However, there is no established vocabulary, leading to confusion when comparing research efforts. The term Web mining has been used in two distinct ways. The first, called Web content mining in this paper, is the process of information discovery from sources across the World Wide Web. The second, called Web usage mining, is the process of mining for user browsing and access patterns. In this paper we define Web mining and present an overview of the various research issues, techniques, and development efforts. We briefly describe WEBMINER, a system for Web usage mining, and conclude this paper by listing research issues. 
Magma An Agent Based Virtual Market for Electronic Commerce.
In this paper, we propose an architecture for an agent-based virtual market that includes all elements required for simulating a real market. These elements include a communication infrastructure, mechanisms for storage and transfer of goods, banking and monetary transactions, and economic mechanisms for direct or brokered producerconsumer transactions. We report findings that resulted from implementing and conducting experiments with a free-market agent architecture (MAGMA). MAGMA is an extensible architecture that provides all services essential to agent-based commercial activities. These services are available through an open-standard messaging API, which allows using a heterogeneous set of agents, independently of the platform and language. 1 Introduction Development of the Internet has spurred a number of attempts to create a virtual marketplace, where agents, both human-controlled and equipped with intelligent algorithms, can participate in trading of physical and electronic goo...
Multi%2DValued Logic Programming Semantics An Algebraic Approach.

Negation as Partial Failure.

